Dependent first order theories, continued
نویسندگان
چکیده
منابع مشابه
Dependent First Order Theories, Continued Sh783
A dependent theory is a (first order complete theory) T which does not have the independence property. A major result here is: if we expand a model of T by the traces on it of sets definable in a bigger model then we preserve its being dependent. Another one justifies the cofinality restriction in the theorem (from a previous work) saying that pairwise perpendicular indiscernible sequences, can...
متن کاملUnstable First-order Theories
In this paper, we examine the divide between stable and unstable first-order theories in model theory. We begin by defining a stable theory and proving Shelah’s theorem, which reduces the question of stability to a problem of examining a single formula. Afterwards, we will provide some applications of the stability/instability divide to other model-theoretic questions, such as the question of c...
متن کاملLearning First Order Theories
In the last decade, many efforts have been devoted to the exploration of techniques for learning and refining first order theories, as the necessary step for applying machine learning methodologies to real world applications. In this paper, we present a new approach to the integration of inductive and deductive learning techniques that seems to overcome some of the limitations of existing learn...
متن کاملCompact Propositional Encodings of First-Order Theories
A propositionalization of a theory in First-Order Logic (FOL) is a set of propositional sentences that is satisfiable iff the original theory is satisfiable. We cannot translate arbitrary FOL theories to propositional logic because FOL is only semi-decidable. However, when possible, it is often advantageous to do so because we can use optimized, efficient SAT solvers (e.g. [Moskewicz et al., 20...
متن کاملExtension of First-Order Theories into Trees
We present in this paper an automatic way to combine any first-order theory T with the theory of finite or infinite trees. First of all, we present a new class of theories that we call zero-infinite-decomposable and show that every decomposable theory T accepts a decision procedure in the form of six rewriting rules which for every first order proposition give either true or false in T . We pre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Israel Journal of Mathematics
سال: 2009
ISSN: 0021-2172,1565-8511
DOI: 10.1007/s11856-009-0082-1